Fast Implementations of
نویسندگان
چکیده
In 6], G. Myers describes a bit-vector algorithm to compute the edit distance between strings. The algorithm converts an input sequence to an output sequence in a parallel way, using bit operations readily available in processors. In this paper, we generalize the technique, and characterize a class of au-tomata for which there exists equivalent parallel, or vector, algorithms. As an application, we extend Myers result to arbitrary weighted edit distances , which are currently used to explore the vast databases generated by genetic sequencing.
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملThe Benefits and implementations of Diffusion tensor imaging and Neural Fiber Tractography in Brain Surgery
Background and Aim: The methods for detecting brain activation with fMRI, MRI provides a way to measure the anatomical connections which enable lightning-fast communication among neurons that specialize in different kinds of brain functions. Diffusion tensor imaging is able to measure the direction of bundles of the axonal fibers which are all aligned. Besides mapping white matter fiber tracts,...
متن کاملMPI- and CUDA- implementations of modal finite difference method for P-SV wave propagation modeling
Among different discretization approaches, Finite Difference Method (FDM) is widely used for acoustic and elastic full-wave form modeling. An inevitable deficit of the technique, however, is its sever requirement to computational resources. A promising solution is parallelization, where the problem is broken into several segments, and the calculations are distributed over different processors. ...
متن کاملComputing with Reads and Writes in the Absence of Step Contention
This paper studies implementations of concurrent objects that exploit the absence of step contention. These implementations use only reads and writes when a process is running solo. The other processes might be busy with other objects, swapped-out, failed, or simply delayed by a contention manager. We study in this paper two classes of such implementations, according to how they handle the case...
متن کاملParallel Implementations of the Fast Sweeping Method
The fast sweeping method is an efficient iterative method for hyperbolic problems. It combines Gauss-Seidel iterations with alternating sweeping orderings. In this paper several parallel implementations of the fast sweeping method are presented. These parallel algorithms are simple and efficient due to the causality of the underlying partial different equations. Numerical examples are used to v...
متن کاملDynamically Reconfigurable FFTs for Cognitive Radio on a Multiprocessor Platform
Multiprocessor platforms have been proposed as an enabling technology for Cognitive Radio. In this paper, we explore various FFT implementations on a multiprocessor prototype platform as building components for OFDM based Cognitive Radio. The results show that our FFT implementations on the multiprocessor platform are fast and energy efficient. Moreover, the FFT implementations can be dynamical...
متن کامل